Analysing the Vulnerability of Public Transport Networks

This paper analyses the robustness of specific public transport networks. Common attributes and which them have more influence on networks’ vulnerability are established. Initially, structural properties networks in two graphical representations (L-Space P-Space) checked. Afterwards, spread problems (traffic jams, etc.) simulated, employing a model based propagation recovery mechanism, similar to those used epidemiological processes. Next, size largest connected subset stops network (giant component) is measured. What shown that faults randomly happened at or links, also displaying occurred highest weighted links slower than others. These others appear with level betweenness, degree, eigenvector centralities PageRank. The modification giant component, when several removed, proves removal interactive PageRank, degree has most significant network’s integrity. Some equivalences centrality parameters been found. All show high modularity values index Q close 1. assortativity lowest average number ones passenger can use travel directly their destination, without any change. Molloy–Reed parameter higher 2 all networks, demonstrating integrity exists them. were characterized by low k-cores ≤3.